On the Role of Interactive Epistemology in Multiagent Planning
نویسنده
چکیده
This paper focuses on the foundational role of interactive epistemology in the problem of generating plans for rational agents in multiagent settings. Interactive epistemology deals with the logic of knowledge and belief when there is more than one agent. In multiagent settings, we are interested in not only the agent’s knowledge of the state of the world, but also its belief over the other agents’ beliefs and their beliefs over others’. We adopt a probabilistic approach for formalizing the epistemology. This paper attempts to answer the question of why we should study the interactive epistemology of agents within the context of multiagent planning. In doing so, it motivates the need for a more detailed examination of the epistemological foundations of multiagent planning. We conclude this paper with a framework for multiagent planning that explicitly constructs and reasons with nested belief structures.
منابع مشابه
Fast Solving of Influence Diagrams for Multiagent Planning on GPU-enabled Architectures
Planning under uncertainty in multiagent settings is highly intractable because of history and plan space complexities. Probabilistic graphical models exploit the structure of the problem domain to mitigate the computational burden. In this paper, we introduce the first parallelization of planning in multiagent settings on a CPU-GPU heterogeneous system. In particular, we focus on the algorithm...
متن کاملInteractive Role of Social Capital Dimensions in Effective Training of Medical Sciences Faculty Members
Introduction: Social capital has been increasingly attracted scholars’ attention in recent years because organizations can improve their effectiveness through establishing, strengthening and developing this intangible but valuable capital. Hence the present study was conducted with the aim of identifying the relationship and predicting effective training through social capital dimensions. Metho...
متن کاملA Multiagent Reinforcement Learning algorithm to solve the Community Detection Problem
Community detection is a challenging optimization problem that consists of searching for communities that belong to a network under the assumption that the nodes of the same community share properties that enable the detection of new characteristics or functional relationships in the network. Although there are many algorithms developed for community detection, most of them are unsuitable when ...
متن کاملImproved Planning for Infinite-Horizon Interactive POMDPs using Probabilistic Inference (Extended Abstract)
We provide the first formalization of self-interested multiagent planning using expectation-maximization (EM). Our formalization in the context of infinite-horizon and finitely-nested interactivePOMDP (I-POMDP) is distinct from EM formulations for POMDPs and other multiagent planning frameworks. Specific to I-POMDPs, we exploit the graphical model structure and present a new approach based on b...
متن کاملIndividual Planning in Infinite-Horizon Multiagent Settings: Inference, Structure and Scalability
This paper provides the first formalization of self-interested planning in multiagent settings using expectation-maximization (EM). Our formalization in the context of infinite-horizon and finitely-nested interactive POMDPs (I-POMDP) is distinct from EM formulations for POMDPs and cooperative multiagent planning frameworks. We exploit the graphical model structure specific to I-POMDPs, and pres...
متن کامل